Revocable identity‐based matchmaking encryption in the standard model
نویسندگان
چکیده
Identity-based Matchmaking Encryption (IB-ME) is an extension notion of matchmaking encryption (CRYPTO 2019), where a sender and receiver can specify access policy for the other party. In IB-ME, data performed by not only identity but also sender's key. Nevertheless, previous IB-ME schemes have considered problem efficient revocation. Hence, authors introduce new revocable (RIB-ME) formalise syntax security model RIB-ME. particular, give effective simple construction RIB-ME in standard model, whose reduced to hardness decisional bilinear Diffie—Hellman computational problem. addition, show two extensions our scheme consider chosen-ciphertext forward privacy.
منابع مشابه
A Fully Secure Revocable ID-Based Encryption in the Standard Model
Revocation problem is a critical issue for key management of public key systems. Any certificate-based or identity (ID)-based public key systems must provide a revocation method to revoke misbehaving/compromised users from the public key systems. In the past, there was little work on studying the revocation problem of ID-based public key systems. Most recently, Tseng and Tsai presented a novel ...
متن کاملFully Private Revocable Predicate Encryption
We introduce the concept of Revocable Predicate Encryption (RPE), which extends the previous PE setting with revocation support: private keys can be used to decrypt an RPE ciphertext only if they match the decryption policy (defined via attributes encoded into the ciphertext and predicates associated with private keys) and were not revoked by the time the ciphertext was created. The first chall...
متن کاملRevocable Identity-Based Encryption Revisited: Security Model and Construction
In ACM CCS 2008, Boldyreva et al. proposed an elegant way of achieving an Identity-based Encryption (IBE) with efficient revocation, which we call revocable IBE (RIBE). One of the significant benefit of their construction is scalability, where the overhead of the trusted authority is logarithmically increased in the number of users, whereas that in the Boneh-Franklin naive revocation way is lin...
متن کاملRevocable Predicate Encryption from Lattices
Predicate encryption, formalized by Katz, Sahai, and Waters (EUROCRYPT 2008), is an attractive branch of public-key encryption, which provides fine-grained and role-based access to encrypted data. As for many multi-user cryptosystems, an efficient revocation mechanism is necessary and imperative in the context of predicate encryption, in order to address scenarios when users misbehave or their ...
متن کاملGeneric Certificateless Encryption in the Standard Model
Despite the large number of certificateless encryption schemes recently proposed, many of them have been found to be insecure under a practical attack called malicious-but-passive KGC attack, since they all follow the same key generation procedure as that of the one proposed by Al-Riyami and Paterson in ASIACRYPT 2003. The only scheme that remains secure against this attack is due to Libert and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Iet Information Security
سال: 2023
ISSN: ['1751-8709', '1751-8717']
DOI: https://doi.org/10.1049/ise2.12116